A Family of Blocked Proportionate Hybrid Error Criterion Algorithms
نویسندگان
چکیده
منابع مشابه
Analysis of Scheduling Algorithms for Proportionate Fairness
Advances in the regularity method p. 2 Fighting spam : the science p. 3 The consequences of Imre Simon's work in the theory of automata, languages, and semigroups p. 5 Querying priced information in databases : the conjunctive case p. 6 Sublinear methods for detecting periodic trends in data streams p. 16 An improved data stream summary : the count-min sketch and its applications p. 29 Rotation...
متن کاملLocal minimum generation error criterion for hybrid HMM speech synthesis
This paper presents an HMM-driven hybrid speech synthesis approach in which unit selection concatenative synthesis is used to improve the quality of the statistical system using a Local Minimum Generation Error (LMGE) during the synthesis stage. The idea behind this approach is to combine the robustness due to HMMs with the naturalness of concatenated units. Unlike the conventional hybrid appro...
متن کاملProportionate Adaptive Filtering under Correntropy Criterion in Impulsive Noise Environments
An improved proportionate adaptive filter based on the Maximum Correntropy Criterion (IP-MCC) is proposed for identifying the system with variable sparsity in an impulsive noise environment. Utilization of MCC mitigates the effect of impulse noise while the improved proportionate concepts exploit the underlying system sparsity to improve the convergence rate. Performance analysis of the propose...
متن کاملA SET−MEMBERSHIP APPROACH TO NORMALIZED PROPORTIONATE ADAPTATION ALGORITHMS (TueAmOR12)
Proportionate adaptive filters can improve the convergence speed for the identification of sparse systems as compared to their conventional counterparts. In this paper, the idea of proportionate adaptation is combined with the framework of set−membership filtering (SMF) in an attempt to derive novel computationally efficient algorithms. The resulting algorithms attain an attractive faster conve...
متن کاملMSE Analysis of the Krylov-proportionate NLMS and NLMF Algorithms
This paper proposes a novel adaptive filtering algorithm which converges faster than the Krylov proportionate normalized least mean square (KPNLMS) algorithm. KPNLMS is known to exhibit faster convergence than the standard NLMS algorithm for all unknown systems. Our algorithm is named Krylov proportionate normalized least mean fourth (KPNLMF) and it deals with mean fourth minimization of the er...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2899695